منابع مشابه
Down at the Track - What Policy, Marketing, & Technology Offer The Sport of Kings
Horse and dog racetracks across the U.S. are experiencing declining attendance and betting handle. This article summarizes an investigation into possible causes and remedies for these trends. Three topics emerged: policy, marketing, and technology. First, industry and political leaders must cooperate in identifying and addressing central political-legal issues. Racing's second focus must be mar...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملLong live the pore
n the first in vivo characterization of nuclear pore complex (NPC) dynamics in mammalian cells, Daigle et al. (page 71; see also the Comment on page 17) have found that NPCs are remarkably stable complexes that appear to be anchored to a protein network in the nuclear envelope. The work also demonstrates the feasibility of tracking single protein complexes in living cells. By fusing GFP tags to...
متن کاملOn the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملThe Problem of the Kings
On a 2m 2n chessboard, the maximum number of nonattacking kings that can be placed is mn, since each 22 cell can have at most one king. Let f m (n) denote the number of ways that mn nonattacking kings can be placed on a 2m 2n chessboard. The purpose of this paper is to prove the following result. such that f m (n) = (c m n + d m)(m + 1) n + O(n m) (n ! 1): For every such placement of kings, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Against the Grain
سال: 1999
ISSN: 2380-176X
DOI: 10.7771/2380-176x.3546